- effectively simple set
- эффективно простое множество
English-Russian scientific dictionary. 2008.
effectively simple set
Смотреть что такое "effectively simple set" в других словарях:
Simple Minds — performing in Oslo, Norway in February 2006 Background information Origin Glasgow, Scotland … Wikipedia
Simple Gifts — is an 1848 Shaker song by Elder Joseph Brackett.It has endured many inaccurate descriptions. Though often classified as an anonymous Shaker hymn or as a work song, it is better classified as a dance song.The composerElder Joseph Brackett was born … Wikipedia
Simple Mail Transfer Protocol — This article is about the Internet standard for electronic mail transmission. For the email delivery company, see SMTP (company). Internet protocol suite Application layer … Wikipedia
Recursively enumerable set — In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable, semidecidable, provable or Turing recognizable if: There is an algorithm such that the set of… … Wikipedia
Feedback arc set — In graph theory, a directed graph may contain directed cycles, a one way loop of edges. In some applications, such cycles are undesirable, and we wish to eliminate them and obtain a directed acyclic graph (DAG). One way to do this is simply to… … Wikipedia
Disjoint-set data structure — In computing, a disjoint set data structure is a data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets. A union find algorithm is an algorithm that performs two useful operations on… … Wikipedia
Instruction set simulator — An instruction set simulator (ISS) is a simulation model, usually coded in a high level programming language, which mimics the behavior of a mainframe or microprocessor by reading instructions and maintaining internal variables which represent… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Centrifugal compressor — Centrifugal compressors, sometimes termed radial compressors, are a sub class of dynamic axisymmetric work absorbing turbomachinery.[1] Centrifugal impeller with a highly polished surface likely to improve performance … Wikipedia
